Game-SAT: A Preliminary Report
نویسندگان
چکیده
Game-SAT is a 2-player version of SAT where two players (MAX and MIN) play on a SAT instance by alternatively selecting a variable and assigning it a value true or false. MAX tries to make the formula true, while MIN tries to make it false. The Game-SAT problem is to determine the winner of a SAT instance under the rules above, assuming the perfect play by both players. The Game-SAT problem, originally derived from an application in adversarial planning, is PSPACE-complete. The problem is similar to QBF, but differs by the property of free variable selection, compared to QBF with its fixed variable ordering. We have developed a Game-SAT solver, Gasaso, that uses a combination of standard game tree search techniques, search methods that are well known in the SAT community, and specialized pruning techniques. We show empirically how the solver performs in this new domain, and give evidence for the existence of phase transitions in this problem.
منابع مشابه
Istituto per La Ricerca Scientifica E Tecnologica from Tableau-based to Sat-based Pro- Cedures { Preliminary Report from Tableau-based to Sat-based Procedures | Preliminary Report
limited distribution notice This report has been submitted for publication outside of ITC and will probably be copyrighted if accepted for publication. It has been issued as a Technical Report for early dissemination of its contents. In view of thetransfer of copyright to the outside publisher, its distribution outside of ITC prior to publication should be limited to peer communications and spe...
متن کاملThe Ninth QBF Solvers Evaluation - Preliminary Report
In this paper we report about the 2016 competitive evaluation of quantified Boolean formulas (QBFs) solvers (QBFEVAL’16), the last in a series of events established with the aim of assessing the advancements in reasoning about QBFs. Aim of this preliminary report is to show at a glance design and results of QBFEVAL’16.
متن کاملFrom Tableau-based to Sat-based Procedures | Preliminary Report
Tableau systems are very popular in AI for their simplicity and versatility. In recent papers we showed that tableau-based procedures are intrinsically ineecient, and proposed an alternative approach of building decision procedures on top of SAT decision procedure. We called this approach \SAT-based". In extensive empirical tests on the case study of modal K, a SAT-based procedure drastically o...
متن کاملVisualizing the Internal Structure of SAT Instances (Preliminary Report)
Modern algorithms for the SAT problem reveal an almost tractable behavior on “real-world” instances. This is frequently contributed to the fact that these instances possess an internal “structure” that hard problem instances do not exhibit. However, little is known about this internal structure. We therefore propose a visualization of the instance’s variable interaction graph (and of its dynami...
متن کاملSolving Satisfiability using Decomposition and the Most Constrained Subproblem (Preliminary Report)
In this paper we provide SAT-solving procedures that use the idea of decomposition together with the heuristic of solving the most constrained subproblem first. We present two approaches. We provide an algorithm to find the most constrained subproblem of a propositional SAT problem in polynomial time. We use this algorithm iteratively to decompose a SAT problem into partitions. We also provide ...
متن کامل